Mapping subtasks with multiple versions on an ad hoc grid

An ad hoc grid is a heterogeneous computing system composed of mobile devices. Each computing resource is constrained in battery energy. The problem being studied is to assign statically computing resources to the subtasks of an application that has an execution time constraint, when the resources are oversubscribed. All subtasks must be executed; to accommodate this in an oversubscribed environment, each subtask has two versions: the primary or 0167-8191/$ see front matter 2005 Elsevier B.V. All rights reserved. doi:10.1016/j.parco.2005.04.003 * Corresponding author. Address: Colorado State University, Department of Computer Science, Fort Collins, CO 80523, USA. E-mail addresses: [email protected] (S. Shivle), [email protected] (P. Sugavanam), [email protected] (H.J. Siegel), [email protected] (A.A. Maciejewski), tarunb@engr. colostate.edu (T. Banka), [email protected] (K. Chindam), [email protected] (S. Dussinger), [email protected] (A. Kutruff), [email protected] (P. Penumarthy), prkash@ engr.colostate.edu (P. Pichumani), [email protected] (P. Satyasekaran), sendekdm@lamar. colostate.edu (D. Sendek), [email protected] (J. Smith), [email protected] (J. Sousa), [email protected]. edu (J. Sridharan), [email protected] (J. Velazco). 672 S. Shivle et al. / Parallel Computing 31 (2005) 671–690 full version, and the secondary or degraded version. The secondary version utilizes only 10% of the resources that the primary version requires, and produces only 10% of the data output for the subsequent children subtasks. Thus, the degraded version (secondary version) represents a reduced capability of lesser overall value, while consuming fewer resources. The goal is to assign resources so that the application meets an execution time constraint and the battery energy constraint while minimizing the number of degraded versions used. Five resource allocation heuristics to derive near-optimal solutions to this problem are presented, evaluated, and compared. 2005 Elsevier B.V. All rights reserved.